Continuous location problems and Big Triangle Small Triangle: constructing better bounds
نویسندگان
چکیده
منابع مشابه
The Big Triangle Small Triangle Method for the Solution of Nonconvex Facility Location Problems
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. INFORMS is collaborating with JSTOR to digitize, preserve ...
متن کاملConstructing Hierarchies for Triangle Meshes
We present a method to produce a hierarchy of triangle meshes that can be used to blend different levels of detail in a smooth fashion. The algorithm produces a sequence of meshes 00, 01, 02, ..., 0n, where each mesh 0i can be transformed to mesh 0i+1 through a set of triangle-collapse operations. For each triangle, a function is generated that approximates the underlying surface in the area of...
متن کاملConstructing Hamiltonian Triangle Strips on Quadrilateral Meshes
Because of their improved numerical properties, quadrilateral meshes have become a popular representation for finite elements computations and computer animation. In this paper we address the problem of optimally representing quadrilateral meshes as generalized triangle strips (with one swap bit per triangle). This is important because 3D rendering hardware is optimized for rendering triangle m...
متن کاملNP-Hard Triangle Packing Problems
In computational geometry, packing problems ask whether a set of rigid pieces can be placed inside a target region such that no two pieces overlap. The triangle packing problem is a packing problem that involves triangular pieces, and it is crucial for algorithm design in many areas, including origami design, cutting industries, and warehousing. Previous works in packing algorithms have conject...
متن کاملTowards Understanding Triangle Construction Problems
Straightedge and compass construction problems are one of the oldest and most challenging problems in elementary mathematics. The central challenge, for a human or for a computer program, in solving construction problems is a huge search space. In this paper we analyze one family of triangle construction problems, aiming at detecting a small core of the underlying geometry knowledge. The analys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2008
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-008-9381-z